Ja n 20 06 CONWAY ’ S NAPKIN PROBLEM

نویسندگان

  • ANDERS CLAESSON
  • T. KYLE PETERSEN
چکیده

The napkin problem was first posed by John H. Conway, and written up as a 'toughie' in " Mathematical Puzzles: A Connoisseur's Collection, " by Peter Winkler. To paraphrase Winkler's book, there is a banquet dinner to be served at a mathematics conference. At a particular table, n men are to be seated around a circular table. There are n napkins, exactly one between each of the place settings. Being doubly cursed as both men and mathematicians, they are all assumed to be ignorant of table etiquette. The men come to sit at the table one at a time and in random order. When a guest sits down, he will prefer the left napkin with probability p and the right napkin with probability q = 1 − p. If there are napkins on both sides of the place setting, he will choose the napkin he prefers. If he finds only one napkin available, he will take that napkin (though it may not be the napkin he wants). The third possibility is that no napkin is available, and the unfortunate guest is faced with the prospect of going through dinner without any napkin! We think of the question of how many people don't get napkins as a statistic for signed permutations, where the permutation gives the order in which people sit and the sign tells us whether they initially reach left or right. We also keep track of the number of guests who get a napkin, but not the napkin they prefer. We find the generating function for the joint distribution of these statistics, and use it to answer questions like: What is the probability that every guest receives a napkin? How many guests do we expect to be without a napkin? How many guests are happy with the napkin they receive?

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conway's Napkin Problem

The Malicious Maitre D’ At a mathematics conference banquet, 48 male mathematicians, none of them knowledgeable about table etiquette, find themselves assigned to a big circular table. On the table, between each pair of settings, is a coffee cup containing a cloth napkin. As each person is seated (by the maitre d’), he takes a napkin from his left or right; if both napkins are present, he choos...

متن کامل

ar X iv : c s / 06 01 13 1 v 1 [ cs . A I ] 3 1 Ja n 20 06 Scalable Algorithms for Aggregating Disparate Forecasts of Probability ∗

In this paper, computational aspects of the panel aggregation problem are addressed. Motivated primarily by applications of risk assessment, an algorithm is developed for aggregating large corpora of internally incoherent probability assessments. The algorithm is characterized by a provable performance guarantee, and is demonstrated to be orders of magnitude faster than existing tools when test...

متن کامل

ar X iv : n uc l - th / 0 60 10 68 v 1 2 4 Ja n 20 06 Neutrino - nucleus reactions in the energy range 1 - 100 MeV

We review some salient aspects of calculations of the neutrino-nucleus reaction cross sections in the low energy range (1-100 MeV).

متن کامل

ar X iv : m at h / 06 01 47 5 v 2 [ m at h . PR ] 2 9 Ja n 20 07 Isoperimetry between exponential and Gaussian

We study the isoperimetric problem for product probability measures with tails between the exponential and the Gaussian regime. In particular we exhibit many examples where coordinate half-spaces are approximate solutions of the isoperimetric problem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006